Behavioural equivalences for fluid stochastic Petri nets
نویسندگان
چکیده
We propose fluid equivalences that allow one to compare and reduce behaviour of labeled fluid stochastic Petri nets (LFSPNs) while preserving their discrete and continuous properties. We define a linear-time relation of fluid trace equivalence and its branching-time counterpart, fluid bisimulation equivalence. Both fluid relations take into account the essential features of the LFSPNs behaviour, such as functional activity, stochastic timing and fluid flow. We consider the LFSPNs whose continuous markings have no influence to the discrete ones, i.e. every discrete marking determines completely both the set of enabled transitions, their firing rates and the fluid flow rates of the incoming and outgoing arcs for each continuous place. Moreover, we require that the discrete part of the LFSPNs should be continuous time stochastic Petri nets. The underlying stochastic model for the discrete part of the LFSPNs is continuous time Markov chains (CTMCs). The performance analysis of the continuous part of LFSPNs is accomplished via the associated stochastic fluid models (SFMs). We show that fluid trace equivalence preserves average potential fluid change volume for the transition sequences of every certain length. We prove that fluid bisimulation equivalence preserves the following aggregated (by such a bisimulation) probability functions: stationary probability mass for the underlying CTMC, as well as stationary fluid buffer empty probability, fluid density and distribution for the associated SFM. Hence, the equivalence guarantees identity of a number of discrete and continuous performance measures. Fluid bisimulation equivalence is then used to simplify the qualitative and quantitative analysis of LFSPNs that is accomplished by means of quotienting (by the equivalence) the discrete reachability graph and underlying CTMC. To describe the quotient associated SFM, the quotients of the probability functions are defined. We also characterize logically fluid trace and bisimulation equivalences with two novel fluid modal logics HMLflt and HMLflb, constructed on the basis of the well-known Hennessy-Milner Logic HML. These results can be seen as operational characterizations of the corresponding logical equivalences. The application example of a document preparation system demonstrates the behavioural analysis via quotienting by fluid bisimulation equivalence.
منابع مشابه
Back-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of ...
متن کاملτ-Equivalences for analysis of concurrent systems modelled by Petri nets with silent transitions
The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (τ -equivalences). Basic τ -equivalences and back-forth τ -bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the ge...
متن کاملPlace Bisimulation Equivalences for Design of Concurrent Systems
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may...
متن کاملDecidability Issues for Petri Nets
This is a survey of some decidability results for Petri nets, covering the last three decades. The presentation is structured around decidability of specific properties, various behavioural equivalences and finally the model checking problem for temporal logics.
متن کاملExploiting stochastic process algebra achievements for generalized stochastic Petri nets
Constructing large Generalized Stochastic Petri Nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.02641 شماره
صفحات -
تاریخ انتشار 2017